RELATIVE CATEGORICITY AND ABSTRACTION PRINCIPLES
نویسندگان
چکیده
منابع مشابه
Relative Categoricity and Abstraction Principles
Many recent writers in the philosophy of mathematics have put great weight on the relative categoricity of the traditional axiomatizations of our foundational theories of arithmetic and set theory ([Par90], [Par08] §49, [McG97], [Lav99], [VW14]). Another great enterprise in contemporary philosophy of mathematics has been Wright’s and Hale’s project of founding mathematics on abstraction princip...
متن کاملComputable Categoricity versus Relative Computable Categoricity
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1-decidable computably categorical structure is relatively ∆2-categorical. We study the complexity of various index sets associated with computable categoricity and relative computable categoricity. We also...
متن کاملRelative categoricity in abelian groups
We consider structures A consisting of an abelian group with a subgroup A distinguished by a 1-ary relation symbol P , and complete theories T of such structures. Such a theory T is (κ, λ)-categorical if T has models A of cardinality λ with |A | = κ, and given any two such models A,B with A = B , there is an isomorphism from A to B which is the identity on A . We state all true theorems of the ...
متن کاملRelative categoricity in abelian groups II
Abstract. We consider structures A consisting of an abelian group with a subgroup A distinguished by a 1-ary relation symbol P , and complete theories T of such structures. Such a theory T is (κ, λ)categorical if T hasmodelsA of cardinality λwith |A | = κ, and given any two such models A,B with A = B , there is an isomorphism from A to B which is the identity on A . We classify all complete the...
متن کاملMarch 22, 2010 RELATIVE CATEGORICITY IN BOOLEAN ALGEBRAS
A computable Boolean algebra A is relatively arithmetically categorical if for any copy B of A there is a an isomorphism from A onto B which is arithmetically computable. We show that the Boolean algebras which are relatively arithmetically categorical are the finitary Boolean algebras introduced by Palyutin and Pierce. The key step along the way to this result is a classification of the relati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Review of Symbolic Logic
سال: 2015
ISSN: 1755-0203,1755-0211
DOI: 10.1017/s1755020315000052